Byzantine-Tolerant, Point-To-Point Information Propagation in Untrustworthy and Unreliable Networks

نویسندگان

  • Kai Han
  • Binoy Ravindran
  • Douglas Jensen
چکیده

In a decentralized network system, an authenticated node is referred to as a Byzantine node, if it is fully controlled by a traitor or an adversary, and can perform destructive behavior to disrupt the system. Typically, Byzantine nodes together or individually attack point-to-point information propagation by denying or faking messages. In this paper, we assume that Byzantine nodes are of some intelligence — that is, they can protect themselves from being identified by authentication mechanisms, including encryption mechanisms. Therefore, a node cannot trust any other node in the system. We present an authentication-free, gossip-based application-level propagation mechanism called LASIRC, in which “healthy” nodes utilize Byzantine features to defend against Byzantine attacks. We show that LASIRC is robust against message-denying and message-faking attacks. Our experimental studies verify LASIRC’s effectiveness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 TOWARDS A SCIENCE OF SURVIVABILITY : A Research Agenda and a Specific Method

Today people design systems to be fault-tolerant or secure, but not both. They assume well-behaved users, but unreliable system components, or they assume reliable system components but ill-intentioned users. The designer of a survivable system must assume system components are unreliable and users untrustworthy. Thus, techniques for ensuring survivability should be inspired by those for making...

متن کامل

Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems

(ABSTRACT) In this proposal, we consider scheduling distributed soft real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node behaviors). We present a distributed real-time scheduling algorithm called Real-Time Gossip (or RTG). RTG considers a distributed (i.e., multi-node) task model where tasks are subject ...

متن کامل

Prediction of Bubble Point Pressure & Asphaltene Onset Pressure During CO2 Injection Using ANN & ANFIS Models

Although CO2 injection is one of the most common methods in enhanced oil recovery, it could alter fluid properties of oil and cause some problems such as asphaltene precipitation. The maximum amount of asphaltene precipitation occurs near the fluid pressure and concentration saturation. According to the description of asphaltene deposition onset, the bubble point pressure has a very special imp...

متن کامل

Network-Aware Mechanisms for Tolerating Byzantine Failures in Distributed Systems

Given the growing reliance of industry and government on online information services such as cloud computing and data centers, efficient fault-tolerance algorithm design is of increasing importance in both industry and academia. In this dissertation, we present some of our efficient fault-tolerant algorithms for distributed systems under both point-to-point and broadcast communication models. F...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007